The connectivity index of a weighted graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ashwini Index of a ‎Graph

Motivated by the terminal Wiener index‎, ‎we define the Ashwini index $mathcal{A}$ of trees as‎ begin{eqnarray*}‎ % ‎nonumber to remove numbering (before each equation)‎ ‎mathcal{A}(T) &=& sumlimits_{1leq i

متن کامل

The connectivity and the Harary index of a graph

The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paperweprovide anupper boundof theHarary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with themaximumHarary index among all graphs with a given number of cut vertices or vertex connectivity or edge connectivity. In ad...

متن کامل

On the eccentric connectivity index of a graph

If G is a connected graph with vertex set V , then the eccentric connectivity of G, ξ C (G), is defined as v∈V deg(v) ec(v) where deg(v) is the degree of a vertex v and ec(v) is its eccentricity. We obtain an exact lower bound on ξ C (G) in terms of order, and show that this bound is satisfied by the star graph. An asymptotically sharp upper bound is also derived. In addition, for trees of give...

متن کامل

Peripheral Wiener Index of a Graph

The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...

متن کامل

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1998

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(98)10096-4